A Wreath Product Approach to Classical Subgroup Theorems
نویسندگان
چکیده
We provide elementary proofs of the Nielsen-Schreier Theorem and the Kurosh Subgroup Theorem via wreath products. Our proofs are diagrammatic in nature and work simultaneously in the abstract and profinite categories. A new proof that open subgroups of quasifree profinite groups are quasifree is also given.
منابع مشابه
Rooted Wreath Products
We introduce “rooted valuation products” and use them to construct universal Abelian lattice-ordered groups (with prescribed set of components) [CHH] from the more classical theory of [Ha]. The Wreath product construction of [H] and [HMc] generalised the Abelian (lattice-ordered) group ideas to a permutation group setting to respectively give universals for transitive (`-) permutation groups wi...
متن کاملCoupled cells with internal symmetry: I. Wreath products
In this paper and its sequel we study arrays of coupled identical cells that possess a ‘global’ symmetry group G, and in which the cells possess their own ‘internal’ symmetry group L. We focus on general existence conditions for symmetry-breaking steady-state and Hopf bifurcations. The global and internal symmetries can combine in two quite different ways, depending on how the internal symmetri...
متن کاملWreath Products in Modular Group Algebras of Some Finite 2-groups
Let K be field of characteristic 2 and let G be a finite nonabelian 2-group with the cyclic derived subgroup G′, and there exists a central element z of order 2 in Z(G)\G′. We prove that the unit group of the group algebra KG possesses a section isomorphic to the wreath product of a group of order 2 with the derived subgroup of the group G, giving for such groups a positive answer to the questi...
متن کاملWreath Decompositions of Finite Permutation Groups
There is a familiar construction with two finite, transitive permutation groups as input and a finite, transitive permutation group, called their wreath product, as output. The corresponding 'imprimitive wreath decomposition concept is the first subject of this paper. A formal definition is adopted and an overview obtained for all such decompositions of any given finite, transitive group. The r...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کامل